Belief Revision in Propositional Knowledge Bases
نویسنده
چکیده
A most crucial problem in knowledge representation is the revision of knowledge when new, possibly contradictory, information is obtained (belief revision). In this paper, we address this problem when the knowledge base is a set of expressions in propositional logic. We introduce a new representation of propositional expressions using 2-dimensional tables and show why this representation is more expressive than classical propositional logic. We exploit this increased expressiveness to devise a solution to the problem of belief revision in propositional knowledge bases and describe how to represent data and knowledge with tables, as well as a simple method to perform revisions under this new notion. Finally, we provide a theoretical foundation of our method and compare it with proposed algorithms from the literature.
منابع مشابه
On the Use of Complex Matrices for Belief Revision
A most crucial problem in knowledge representation is the revision of knowledge when new, possibly contradictory, information is obtained (belief revision). In this paper, we address this problem for propositional knowledge bases. We introduce a new representation of propositional expressions using 2dimensional matrices and describe the intuitive processes leading to this representation. We pre...
متن کاملBelief Revision using Table Transformation
A most crucial problem in knowledge representation is the revision of knowledge when new, possibly contradictory, information is obtained (belief revision). In this report, we address this problem when the knowledge base is a set of expressions in propositional logic. We introduce a new representation of propositional expressions using 2-dimensional matrices and provide the theoretical underpin...
متن کاملComputing multiple c-revision using OCF knowledge base
Belief revision is the process of revising epistemic states in the light of new information. In this paper epistemic states are represented in the framework of Spohn’s Ordinal Conditional Functions (OCF). The input is a consistent set of propositional formulas issued from different and independent sources. We focus on the so-called multiple iterated belief crevision recently proposed by Kern-Is...
متن کاملSays Who ? – Incorporating Source Credibility Issues into Belief Revision 1 CSE Technical Report 99 - 08
We discuss some belief revision theories and the implementation of some of them in SNeBR, the belief revision subsystem of the SNePS knowledge representation and reasoning system. The following guidelines are important to belief revision: 1. minimize information removal 2. retract less-plausible beliefs before more-plausible ones. Alterations to SNeBR that provide users with information to help...
متن کاملContraction in Propositional Logic
The AGM model for the revision and contraction of belief sets provides rationality postulates for each of the two cases. In the context of finite propositional logic, Katsuno and Mendelzon pointed out postulates for the revision of belief bases which correspond to the AGM postulates for the revision of beliefs sets. In this paper, we present postulates for the contraction of propositional belie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001